Efficient multicast routing with delay constraints
نویسندگان
چکیده
منابع مشابه
E$cient multicast routing with delay constraints
To support real-time multimedia applications in BISDN networks, QoS guaranteed multicast routing is essential. Traditional multicast routing algorithms used for solving the Steiner tree problem cannot be used in this scenario, because QoS constraints on links are not considered. In this paper, we present two e$cient source-based multicast routing algorithms in directed networks. The objective o...
متن کاملImproved multicast routing with delay and delay variation constraints
Multi point Routing algorithms capable of satisfying Quality of Service constraints such as Delay Bounded-ness and Delay Variation Bounded-ness are becoming crucial with the advent of high speed networks. This paper addresses the problem of determining minimum cost paths to nodes in a Multicast group satisfying delay bounds and delay variation bounds. A routing protocol is proposed and compared...
متن کاملAn Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and tens of heuristics have been developed to solve this NP-complete problem. Among all the previously proposed algorithms, the bounded shortest path algorithm (BSMA) [15] have proved to be capable of producing a multicast t...
متن کاملAn Efficient Algorithm for Shortest Path Multicast Routing under Delay and Delay Variation Constraints
A new heuristic algorithm is proposed for constructing multicast tree for multimedia and interactive applications that require certain quality of services, QoS. We consider two main QoS parameters that are the delay and delay variation. The problem is formulated as constructing shortest path tree under delay and delay variation constraints. The tree is used to concurrently transmit packets from...
متن کاملDistributed delay constrained multicast routing algorithm with efficient fault recovery
Existing distributed delay constrained multicast routing algorithms construct a multicast tree in a sequential fashion and need to be restarted when failures occur during the multicast tree construction phase or during an on-going multicast session. This article proposes an efficient distributed delay constrained multicast routing algorithm that constructs a multicast tree in a concurrent fashi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Communication Systems
سال: 1999
ISSN: 1074-5351,1099-1131
DOI: 10.1002/(sici)1099-1131(199905/06)12:3<181::aid-dac394>3.0.co;2-y